A Decoding Algorithm for Some Convolutional Codes Constructed from Block Codes

نویسندگان

  • Sudhakar M. Reddy
  • John P. Robinson
چکیده

A new decoding algorithm for some convolution~l codes constructed from block codes is given. The algorithm utilizes the decoding algorithm for the corresponding block code. It is shown that the codes obtained from one-step orthogonalizable block codes are majority deeodable. Error propagation in some of these convolutional codes is studied. It is shown that if decoded with moderately reduced capability, these codes exhibit limited error propagation. A mode switching decoding method is suggested to realize a larger error correction capability while maintaining limited error propagation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

تجزیه و تحلیل عملکرد کدهای کانولوشنال تعریف شده در میدان حقیقی در کانال فیدینگ و در حضور نویز کوانتیزاسیون

Channel coding is one of the techniques used for suppression of fading and channel noise effects. Most of the researches on channel codes have been focused on the codes which are defined on Galois fields. Since two decades ago, using channel codes defined on Real and Complex fields has been considered for joint sourcechannel coding in multimedia transmission; but most of the works have focused ...

متن کامل

An Algebraic Decoding Algorithm for Convolutional Codes

The class of convolutional codes generalizes the class of linear block codes in a natural way. The construction of convolutional codes which have a large free distance and which come with an e cient decoding algorithm is a major task. Contrary to the situation of linear block codes there exists only very few algebraic construction of convolutional codes. It is the purpose of this article to int...

متن کامل

Decoding of Block and Convolutional Codes in Rank Metric DISSERTATION

Rank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowadays...

متن کامل

Decoding of block and convolutional codes in rank metric

R ank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowaday...

متن کامل

New multilevel codes over GF(q)

In this paper, we apply set partitioning to multi-dimensional signal spaces over GF(q), particularly GFq-l(q) and GFq(q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). We present two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum ,1-1 • { d } distance d_n >_ d, where n =...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Information and Control

دوره 13  شماره 

صفحات  -

تاریخ انتشار 1968